An efficient algorithm for concurrent priority queue heaps
نویسندگان
چکیده
منابع مشابه
An Efficient Algorithm for Concurrent Priority Queue Heaps
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar (1988), but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to reduce contention. Because insertions do not have to traverse the entire hei...
متن کاملAn E cient Algorithm for Concurrent Priority Queue Heaps
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar [7], but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to reduce contention. Because insertions do not have to traverse the entire height...
متن کاملMSL Based Concurrent and Efficient Priority Queue
Priority queues are fundamental in the design of modern multiprocessor algorithms. Priority queues with parallel access are an attractive data structure for applications like prioritized online scheduling, discrete event simulation, or branch-and-bound. This paper proposes an alternative approach: to base the design of concurrent priority queues on the Modified Skip List data structure. To this...
متن کاملEfficient Wait-Free Implementation of a Concurrent Priority Queue
Binary snapshots p. 18 Linear-time snapshot protocols for unbalanced systems p. 26 Towards a necessary and sufficient condition for wait-free synchronization p. 39 Efficient algorithms for checking the atomicity of a run of read and write operations p. 54 Benign failure models for shared memory p. 69 Generalized agreement between concurrent fail-stop processes p. 84 Controlling memory access co...
متن کاملAn E cient Algorithm for Concurrent Priority
We present a new algorithm for concurrent access to array-based priority queue heaps. Deletions proceed top-down as they do in a previous algorithm due to Rao and Kumar 6], but insertions proceed bottom-up, and consecutive insertions use a bit-reversal technique to scatter accesses across the fringe of the tree, to reduce contention. Because insertions do not have to traverse the entire height ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1996
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00148-2